Robust Matchings
نویسندگان
چکیده
We consider complete graphs with nonnegative edge weights. A p-matching is a set of p disjoint edges. We prove the existence of a maximal (with respect to inclusion) matching M that contains for any p ≤ |M | p edges whose total weight is at least 1 √ 2 of the maximum weight of a p-matching. We use this property to approximate the metric maximum clustering problem with given cluster sizes.
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملJonathan Newton
This paper considers marriage problems, roommate problems with nonempty core, and college admissions problems with responsive preferences. All stochastically stable matchings are shown to be contained in the set of matchings which are most robust to one-shot deviation.
متن کاملA one-shot deviation principle for stability in matching problems
This paper considers marriage problems, roommate problems with nonempty core, and college admissions problems with responsive preferences. All stochastically stable matchings are shown to be contained in the set of matchings which are most robust to one-shot deviation.
متن کاملRobust randomized matchings
The following zero-sum game is played on a weighted graph G: Alice selects a matching M in G and Bob selects a number k. Then, Alice receives a payoff equal to the ratio of the weight of the top k edges of M to optk, which is the maximum weight of a matching of size at most k in G. If M guarantees a payoff of at least α then it is called α-robust. In 2002, Hassin and Rubinstein gave an algorith...
متن کاملThe number of maximal matchings in polyphenylene chains
A matching is maximal if no other matching contains it as a proper subset. Maximal matchings model phenomena across many disciplines, including applications within chemistry. In this paper, we study maximal matchings in an important class of chemical compounds: polyphenylenes. In particular, we determine the extremal polyphenylene chains in regards to the number of maximal matchings. We also de...
متن کاملData association in stochastic mapping using the joint compatibility test
In this paper, we address the problem of robust data association for simultaneous vehicle localization and map building. We show that the classical gated nearest neighbor approach, which considers each matching between sensor observations and features independently, ignores the fact that measurement prediction errors are correlated. This leads to easily accepting incorrect matchings when clutte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 15 شماره
صفحات -
تاریخ انتشار 2002